A Sharp Bound for the Growth of Minimal Graphs

نویسندگان

چکیده

We consider minimal graphs $$u = u(x,y) > 0$$ over unbounded domains $$D \subset R^2$$ bounded by a Jordan arc $$\gamma $$ on which . prove sort of reverse Phragmén-Lindelöf theorem showing that if D contains sector $$\begin{aligned} S_{\lambda }=\{(r,\theta )=\{-\lambda /2<\theta<\lambda /2\},\quad \pi <\lambda \le 2\pi , \end{aligned}$$ then the rate growth is at most $$r^{\pi /\lambda }$$

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

The lower bound for the number of 1-factors in generalized Petersen graphs

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

متن کامل

A Bound for the Nilpotency Class of a Lie Algebra

In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.

متن کامل

The Sharp Lower Bound for the Spectral Radius of Connected Graphs with the Independence Number

In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize all extremal connected graphs which attain the minimum value among the spectral radii of all connected graphs with order n = kα and the independence number α. Moreover, all extremal graphs which attain the maximum value among the spectral radii of clique trees with orde...

متن کامل

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Methods and Function Theory

سال: 2021

ISSN: ['2195-3724', '1617-9447']

DOI: https://doi.org/10.1007/s40315-021-00417-1